@MastersThesis{Souza:2014:MeHíPr,
author = "Souza, Ligia Corr{\^e}a de",
title = "Meta-heur{\'{\i}}sticas h{\'{\i}}bridas para o problema
probabil{\'{\i}}stico de localiza{\c{c}}{\~a}o de m{\'a}xima
cobertura",
school = "Instituto Nacional de Pesquisas Espaciais (INPE)",
year = "2014",
address = "S{\~a}o Jos{\'e} dos Campos",
month = "2014-04-10",
keywords = "localiza{\c{c}}{\~a}o de facilidades, problema
probabil{\'{\i}}stico de
localiza{\c{c}}{\~a}o-aloca{\c{c}}{\~a}o de m{\'a}xima
cobertura, meta-heur{\'{\i}}stica, Adaptive Large Neighborhood
Search, facility location, probabilistic maximal covering location
allocation problem, metaheuristic, Adaptive Large Neighborhood
Search.",
abstract = "Problemas de localiza{\c{c}}{\~a}o de facilidades tratam de
decis{\~o}es relativas ao atendimento da demanda por produtos ou
servi{\c{c}}os para um indiv{\'{\i}}duo ou uma
popula{\c{c}}{\~a}o, considerando aspectos log{\'{\i}}sticos.
O Problema Probabil{\'{\i}}stico de Localiza{\c{c}}{\~a}o
Aloca{\c{c}}{\~a}o de M{\'a}xima Cobertura {\'e} um problema
de localiza{\c{c}}{\~a}o de facilidades, que visa localizar p
centros, a fim de maximizar o atendimento {\`a} demanda para uma
dada dist{\^a}ncia de cobertura, considerando aspectos de
qualidade de servi{\c{c}}o. Nesta disserta{\c{c}}{\~a}o {\'e}
estudada a utiliza{\c{c}}{\~a}o das meta-heur{\'{\i}}sticas
Large Neighborhood Search e Adaptive Large Neighborhood Search
para resolver este problema. Os resultados obtidos com a
utiliza{\c{c}}{\~a}o deste m{\'e}todo s{\~a}o comparados com
os resultados obtidos pelo software CPLEX e com os resultados da
literatura, estabelecendo as medidas de desempenho, tais como
tempos de execu{\c{c}}{\~a}o e qualidade da solu{\c{c}}{\~a}o,
da abordagem utilizada. ABSTRACT: Facility location problems deal
with decisions concerning the satisfaction of the demand for
products or services of an individual or a population, considering
logistical aspects. The Probabilistic Maximal Covering Location
Allocation Problem is a facility location problem that aims to
locate p centers in order to maximize the attended demand for a
given covering distance, considering service quality aspects. The
present dissertation investigates the use of the metaheuristics
Large Neighborhood Search and Adaptive Large Neighborhood Search
to solve this problem. The results obtained with the use of these
methods are compared with results obtained by CPLEX software and
the literature results, establishing performance measures, such as
computing times and solution quality, of this approach.",
committee = "Carvalho, Solon Ven{\^a}ncio de (presidente) and Lorena, Luiz
Antonio Nogueira (orientador) and Pereira, Marcos Antonio
(orientador) and Chaves, Ant{\^o}nio Augusto and Salles Neto,
Luiz Ledu{\'{\i}}no de",
englishtitle = "Hybrid methods for the probabilistic maximal covering location
allocation problem",
language = "pt",
pages = "77",
ibi = "8JMKD3MGP5W34M/3G7U6HB",
url = "http://urlib.net/ibi/8JMKD3MGP5W34M/3G7U6HB",
targetfile = "publicacao.pdf",
urlaccessdate = "08 maio 2024"
}